Image Reconstruction Through Regularization by Envelope Guided Conjugate Gradients
نویسندگان
چکیده
29 Figure 12: Tail strategy for 10 million registered photon pairs. all images in enhanced display. 28 Figure 11: Tail strategy for 10 million registered photon pairs. The result of the quadratic case was used as start for the other cases; all images in enhanced display. top row: quadratic, log for = 2 13 , logcosh for = 2 5 ; bottom row: Huber for, = 2 8 , multiquadric for = 2 8 , rational for = 2 17. Again the convex, asymptotically linear penalty terms removed most high frequency noise and were less sensitive to the precise choice of. The most insensitive formula was the multiquadric penalty (8), which produced excellent results over a wide range of 's; see Figure 12. A hitherto unexplored semirational formula, (27) behaved very similar, but avoids the calculation of square roots. 27 Figure 10: Same as previous gure, but with corners deened by the diierence quotient bringing the penalty close to the absolute value penalty slow down the pcg method, resulting in a degradation of the image when, as in our experiments, the number of iterations is xed. In Figure 8, we show, for the Huber penalty (9), the dependence of the results of the corner strategy on. The same is done for the tail strategy in Figure 9. Moreover, to show the innuence of the formula used to compute the corner, we did these calculations also using version 2, i.e., equation (22) as a measure of bentness, giving the results displayed in Figure 10. Here (but not in general) version 2 produced the most pleasing results of all our methods. Case 2: 10 million photon pairs The high photon case is, in comparison, much easier, and produces reconstructed images of good quality. Best results were obtained using 32 iterations of the tail strategy with the quadratic penalty function (4) to compute a good starting point, used with the tail strategy for the nonlinear penalties (another 32 iterations). Figure 11 shows the results for optimal choices of the scaling parameter , found by trying all powers of 2 in a reasonable range. 26 Figure 9: Sensitivity for Huber penalty (enhanced display): tail strategy for Because of the noise in the phantom, the randomness in choosing the direction of the annihilating photons and the inaccuracy resulting from the discretization used to set up the matrix, the noise level only barely allows the reconstruction …
منابع مشابه
Regularization of Ill-Posed Problems by Envelope Guided Conjugate Gradients
18 of. Obviously the tail strategy is an improvement over iterating the PCG method without regularization. Thus we have shown that the envelope guided conjugate gradient strategy of section 3 has been successfully applied to a problem. It is inexpensive, robust, and eeective.
متن کاملSignal Reconstruction in Sensor Arrays Using Temporal-Spatial Sparsity Regularization
We propose a technique of multisensor signal reconstruction based on the assumption, that source signals are spatially sparse, as well as have sparse [wavelet-type] representation in time domain. This leads to a large scale convex optimization problem, which involves l1 norm minimization. The optimization is carried by the Truncated Newton method, using preconditioned Conjugate Gradients in inn...
متن کاملMinimum weighted norm interpolation of seismic records
In seismic data processing, we often need to interpolate and extrapolate data at missing spatial locations. The reconstruction problem can be posed as an inverse problem where, from inadequate and incomplete data, we attempt to reconstruct the seismic wavefield at locations where measurements were not acquired. We propose a wavefield reconstruction scheme for spatially band-limited signals. The...
متن کاملVogel and Oman : Total Variation Based Image Reconstruction 101
| Tikhonov regularization with a modiied total variation regularization functional is used to recover an image from noisy, blurred data. This approach is appropriate for image processing in that it does not place a priori smoothness conditions on the solution image. An eecient algorithm is presented for the discretized problem which combines a xed point iteration to handle nonlinearity with an ...
متن کاملSeveral Mathematical Methods Applied in Image Compression and Restoration
Several mathematical methods are discussed in this paper, which are applied in image compression and restoration. Singular value decomposition (SVD) is used in compressing image. Conjugate gradients (CG) method and truncated Singular value decomposition (TSVD) regularization method are applied in image restoration. From the experience results we can see that those methods are effective in image...
متن کاملImplementation of Modified Conjugate Gradient Algorithm and Analysis of Convergence in Electromagnetic Tomography Lab System
Electromagnetic tomography technology is a new process tomography technology. The aim of this study is to develop a new image reconstruction algorithm suitable to electromagnetic tomography and verify its convergence. The advantages and development of electromagnetic tomography technology and image reconstruction algorithms are introduced briefly. Based on conjugate gradient algorithm, modified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994